1

Extractors from Reed–Muller codes

Year:
2006
Language:
english
File:
PDF, 276 KB
english, 2006
2

On the complexity of price equilibria

Year:
2003
Language:
english
File:
PDF, 191 KB
english, 2003
3

Relating word and tree automata

Year:
2006
Language:
english
File:
PDF, 301 KB
english, 2006
4

Probabilistic checking of proofs: a new characterization of NP

Year:
1998
Language:
english
File:
PDF, 347 KB
english, 1998
8

On the hardness of approximating label-cover

Year:
2004
Language:
english
File:
PDF, 205 KB
english, 2004
9

The Erdős–Hajnal conjecture for bull-free graphs

Year:
2008
Language:
english
File:
PDF, 132 KB
english, 2008
10

A parallel implementation of Flat Concurrent Prolog

Year:
1986
Language:
english
File:
PDF, 1.41 MB
english, 1986
11

On the complexity of approximating tsp with neighborhoods and related problems

Year:
2006
Language:
english
File:
PDF, 1.21 MB
english, 2006
12

On the complexity of approximatingk-set packing

Year:
2006
Language:
english
File:
PDF, 213 KB
english, 2006
14

On the Hardness of Approximating the Chromatic Number

Year:
2000
Language:
english
File:
PDF, 311 KB
english, 2000
16

A well-characterized approximation problem

Year:
1993
Language:
english
File:
PDF, 459 KB
english, 1993
17

Testing juntas

Year:
2004
Language:
english
File:
PDF, 432 KB
english, 2004
18

Multiway merge with constant delay in Concurrent Prolog

Year:
1986
Language:
english
File:
PDF, 276 KB
english, 1986
19

A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem

Year:
2000
Language:
english
File:
PDF, 453 KB
english, 2000
20

Exponential Determinization for ω‐Automata with a Strong Fairness Acceptance Condition

Year:
2006
Language:
english
File:
PDF, 166 KB
english, 2006
23

Algorithmic construction of sets for k -restrictions

Year:
2006
Language:
english
File:
PDF, 210 KB
english, 2006